An Analysis of Vertical Splitting Algorithm

Distribution design involves making decisions on the fragmentation and allocation of data across the sites of a computer network. Vertical splitting is the process of subdividing the attributes of a relation to generate fragments. In this paper, we propose an analysis for vertical splitting algorithm using prototype approach. This approach starts from the attribute affinity matrix and generates initial clusters based on the affinity values between attributes. Then, it uses the database according to optimal splitting solution to produce final groups that will represent the fragments. Then we analysed these fragments according to their contribution level. The result is generated that shows how to find optimal solutions.